Logical equivalence between generalized urn models and finite automata

To every generalized urn model there exists a finite (Mealy) automaton with identical propositional calculus. The converse is true as well.Comment: 9 pages, minor change

Quantum advantage by relational queries about physically realizable equivalence classes

Relational quantum queries are sometimes capable to effectively decide between collections of mutually exclusive elementary cases without completely resolving and determining those individual instances. Thereby the set of mutually exclusive elementary cases is effectively partitioned into equivalence classes pertinent to the respective query. In the second part of the paper, we review recent progress in theoretical certifications (relative to the assumptions made) of quantum value indeterminacy as a means to build quantum oracles for randomness.Comment: 8 Pages, one figure, invited contribution to TopHPC2019, Tehran, Iran, April 22-25, 201